package com.wyp168.leetcode.kedaxunfei;

import java.util.Scanner;

/**
 * @ClassName OneQuestionSolution
 * @Title TODO
 * @Description TODO
 * @Author wyp168
 * @Date 2022/10/22 19:30
 */
public class OneQuestionSolution {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int index = 0;
        int[] nums = new int[n];
        while (index < n && scanner.hasNext()) {
            nums[index++] = scanner.nextInt();
        }
        for (int i = 0; i < n; i++) {
            nums[i] = (int) (2595 * Math.log10(1 + (double)nums[i]/700));
            System.out.print(nums[i]);
            if (!(i == n - 1)) {
                System.out.print(" ");
            }
        }

    }
}
